Metric inequalities, cutset inequalities and Benders feasibility cuts for multicommodity capacitated network design
نویسندگان
چکیده
Metric inequalities, cutset inequalities and Benders feasibility cuts are three families of valid inequalities that have been widely used in different algorithms for network design problems. This article sheds some light on the interrelations between these three families of inequalities. In particular, we show that cutset inequalities are a subset of the Benders feasibility cuts, and that Benders feasibility cuts (including cutset inequalities) are not, in general, metric inequalities. We also propose a simple procedure to convert Benders feasibility cuts into stronger metric inequalities. Computational results show the efficiency of the strengthening procedure.
منابع مشابه
Benders, metric and cutset inequalities for multicommodity capacitated network design
Solving multicommodity capacitated network design problems is a hard task that requires the use of several strategies like relaxing some constraints and strengthening the model with valid inequalities. In this paper, we compare three sets of inequalities that have been widely used in this context: Benders, metric and cutset inequalities. We show that Benders inequalities associated to extreme r...
متن کاملA Fast Strategy to Find Solution for Survivable Multicommodity Network
This paper proposes an immediately efficient method, based on Benders Decomposition (BD), for solving the survivable capacitated network design problem. This problem involves selecting a set of arcs for building a survivable network at a minimum cost and within a satisfied flow. The system is subject to failure and capacity restriction. To solve this problem, the BD was initially proposed with ...
متن کاملA cutting-plane algorithm based on cutset inequalities for multicommodity capacitated fixed charge network design
The multicommodity capacitated fixed charge network design problem is a well-known NPhard problem which arises in a wide variety of applications, most notably in transportation and telecommunications. In this paper, we propose to improve the mixed integer programming (MIP) formulation of the problem by using a polyhedral approach. We present a cutting-plane algorithm which incorporates valid in...
متن کاملOn cut-based inequalities for capacitated network design polyhedra
In this article we study capacitated network design problems. We unify and extend poly-hedral results for directed, bidirected and undirected link capacity models. Based on validinequalities for a network cut we show that regardless of the link capacity model, facets of thepolyhedra associated with such a cut translate to facets of the original network design polyhedraif the...
متن کاملCapacitated network design using general flow-cutset inequalities
This paper deals with directed, bidirected, and undirected capacitated network design problems. Using mixed integer rounding (MIR), we generalize flow-cutset inequalities to these three link types and to an arbitrary modular link capacity structure, and propose a generic separation algorithm. In an extensive computational study on 54 instances from the Survivable Network Design Library (SNDlib)...
متن کامل